Unbiased decision making in location-routing problems with uncertain customer demands
نویسندگان
چکیده
Abstract In this paper, we focus on a location-routing problem (LRP) in the dairy industry. This consists of locating cold storage warehouse, from which vehicles limited capacity are dispatched to serve given number supermarkets with uncertain service requirements, and determining order served by each vehicle. First, LRP is solved using classical approach based deterministic model where i.e. customer demands, defined through sample means. Second, propose an indifference zone LRP. The procedures specific ranking selection methods aimed at selecting best option set alternative configurations. particular, they attempt guarantee probability correct choice, while minimising computational effort. numerical results presented paper highlight risk biased decision making when mere means used model. addition, show effectiveness approaches products distribution activity.
منابع مشابه
Robust location transportation problems under uncertain demands
In robust optimization, the multi-stage context (or dynamic decision-making) assumes that the information is revealed in stages. So, part of the decisions must be taken before knowing the real values of the uncertain parameters, and another part, called recourse decisions, is taken when the information is known. In this paper, we are interested in a robust version of the location transportation...
متن کاملSolving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amount of time available for processing difficult combinatorial tasks. Our approach uses predictable variability in computational demands to allocate on-line deliberation time and exploits problem regularity and stochastic models of environmental dynamics t...
متن کاملAnticipating Computational Demands when Solving Time-Critical Decision-Making Problems
An agent embedded in a dynamic environment may need to respond in a timely manner to sequences of events outside the agent's control. By anticipating computational demands and allocating processing time accordingly the agent can avoid costly delays often arising from trying to respond to a dynamic environment with high-complexity decision procedures. Deliberation scheduling, the process of allo...
متن کاملWireless Mesh Network Routing Under Uncertain Demands
Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optim...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2022
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-022-06785-7